Algorithms for sequence analysis via mutagenesis
نویسندگان
چکیده
MOTIVATION Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique. RESULTS The essential idea of SAM is to infer the target sequence using the sequences of mutants derived from the target. We describe three algorithms used in this process. The first algorithm predicts the number of mutants that will be required to infer the target sequence with a desired level of accuracy. The second algorithm infers the target sequence itself, using the mutant sequences. The third algorithm assigns quality values to each inferred base. The algorithms are illustrated using mutant sequences generated in the laboratory.
منابع مشابه
A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملMolecular Cloning and Mutagenesis of Rat Glucocerebrosidase Gene
Purpose: The aim of this study was cloning the Gba enzyme in pUCBM21 plasmid, and making frame mutation on it and sequencing it. Materials and methods: mRNA was extracted from mouse spleen and glucocerebrosidase cDNA was synthesized and amplified by PCR with specific primers. cDNA was cloned in pUCBM21 and analyzed by restriction enzymes. A fragment of its sequence was deleted using MscI restr...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملA Single Point Mutation within the Coding Sequence of Cholera Toxin B Subunit Will Increase Its Expression Yield
Background: Cholera toxin B subunit (CTB) has been extensively considered as an immunogenic and adjuvant protein, but its yield of expression is not satisfactory in many studies. The aim of this study was to compare the expression of native and mutant recombinant CTB (rCTB) in pQE vector. Methods: ctxB fragment from Vibrio cholerae O1 ATCC14035 containing the substitution of mutant ctxB for ami...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bioinformatics
دوره 20 15 شماره
صفحات -
تاریخ انتشار 2004